منابع مشابه
Tuples of Disjoint NP-Sets
Disjoint NP-pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NP-pairs to disjoint k-tuples of NP-sets for k ≥ 2. We define subclasses of the class of all disjoint k-tuples of NP-sets. These subclasses are associated with a proposition...
متن کاملThe Complexity of Unions of Disjoint Sets
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we approach the main question in a more general way: We analyze the scope of the complexity of unions o...
متن کاملSplitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the c...
متن کاملAutoreducibility of NP-Complete Sets
We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the following: • For every k ≥ 2, there is a k-T-complete set for NP that is k-T autoreducible, but is not k-tt autoreducible or (k − 1)-T autoreducible. • For every k ≥ 3, there is a k-tt-complete set for NP that is k-tt autor...
متن کاملFinding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete
Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will present a reduction from planar Hamiltonian path to this problem, and prove that it is NP-Complete. To the best of our knowledge, no study has considered its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2014
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2591508